A Congruence Theorem for Structured Operational Semantics with Predicates

نویسندگان

  • Jos C. M. Baeten
  • Chris Verhoef
چکیده

We proposed a syntactical format, the path format, for structured operational semantics in which predicates may occur. We proved that strong bisim-ulation is a congruence for all the operators that can be deened within the path format. To show that this format is useful we provided many examples that we took from the literature about CCS, CSP, and ACP; they do satisfy the path format but no formats proposed by others.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises

We proposed a syntactic format, the panth format, for structured operational semantics in which besides ordinary transitions also predicates, negated predicates, and negat.ed transitions may occur such that if the rules are stratifiable strong bisimulation equivalence is a cOllgruence for all the operators that can be defined within the panik format.. To show that this format is useful we took ...

متن کامل

A congruence theorem for structured operational semantics with predicates

We proposed a syntactical format the path format for structured operational semantics in which predicates may occur We proved that strong bisim ulation is a congruence for all the operators that can be de ned within the path for mat To show that this format is useful we provided many examples that we took from the literature about CCS CSP and ACP they do satisfy the path format but no formats p...

متن کامل

A congruence theorem for structured operational semantics with predicates

We proposed a syntactical format the path format for structured operational semantics in which predicates may occur We proved that strong bisim ulation is a congruence for all the operators that can be de ned within the path for mat To show that this format is useful we provided many examples that we took from the literature about CCS CSP and ACP they do satisfy the path format but no formats p...

متن کامل

Rooted Branching Bisimulation as a Congruence

This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements of Groote's ntyft format. It extends an earlier format by Bloom with standard notions such as recursion, iteration, predicates, and negative premises.

متن کامل

A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages

In this paper we describe the promoted tyft/tyxt rule format for deening higher-order languages. The rule format is a generalization of Groote and Vaan-drager's tyft/tyxt format in which terms are allowed as labels on transitions in rules. We prove that bisim-ulation is a congruence for any language deened in promoted tyft/tyxt format and demonstrate the usefulness of the rule format by present...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993